Encapsulating deontic and branching time specifications

State/Event Software Verification for Branching-Time Specifications

In the domain of concurrent software verification, there is an evident need for specification formalisms and efficient algorithms to verify branching-time properties that involve both data and communication. We address this problem by defining a new branching-time temporal logic SE-AΩ which integrates both state-based and action-based properties. SE-AΩ is universal, i.e., preserved by the simul...

A Functional Program for Agents, Actions, and Deontic Specifications

We outline elements of the Abstract Contract Calculator, a prototype language implemented in Haskell (a declarative programming language) in which we simulate agents executing abstract actions relative to deontic specifications. The deontic specifications are prohibition, permission, and obligation. The concepts of deontic specifications are derived from Standard Deontic Logic and Dynamic Deont...

Synthesizing Masking Fault-Tolerant Systems from Deontic Specifications

In this paper, we study the problem of synthesizing faulttolerant components from specifications, i.e., the problem of automatically constructing a fault-tolerant component implementation from a logical specification of the component, and the system’s required level of fault-tolerance. We study a specific level of fault-tolerance: masking tolerance. A system exhibits masking tolerance when both...

Deontic norms, deontic reasoning, and deontic conditionals

Deontic reasoning is thinking about whether actions are forbidden or allowed, obligatory or not obligatory. It is proposed that social norms, imposing constraints on individual actions, constitute the fundamental concept for the system of these four deontic modalities, and that people reason from such norms flexibly according to deontic core principles. Two experiments are presented, one on deo...

Cumulativity, Identity and Time in Deontic Logic